Distributing vertices along a Hamiltonian cycle in Dirac graphs
نویسندگان
چکیده
منابع مشابه
Robust Hamiltonicity of Dirac graphs
A graph is Hamiltonian if it contains a cycle which passes through every vertex of the graph exactly once. A classical theorem of Dirac from 1952 asserts that every graph on n vertices with minimum degree at least n/2 is Hamiltonian. We refer to such graphs as Dirac graphs. In this paper we extend Dirac’s theorem in two directions and show that Dirac graphs are robustly Hamiltonian in a very st...
متن کاملDistributing vertices on Hamiltonian cycles
Let G be a graph of order n and 3 ≤ t ≤ n4 be an integer. Recently, Kaneko and Yoshimoto provided a sharp δ(G) condition such that for any set X of t vertices, G contains a hamiltonian cycle H so that the distance along H between any two vertices of X is at least n/2t. In this paper, minimum degree and connectivity conditions are determined such that for any graph G of sufficiently large order ...
متن کاملA fast parallel algorithm for finding Hamiltonian cycles in dense graphs
Suppose that 0 < η < 1 is given. We call a graph, G, on n vertices an η-Chvátal graph if its degree sequence d1 ≤ d2 ≤ · · · ≤ dn satisfies: for k < n/2, dk ≤ min{k + ηn, n/2} implies dn−k−ηn ≥ n − k. (Thus for η = 0 we get the well-known Chvátal graphs.) An NC4-algorithm is presented which accepts as input an η-Chvátal graph and produces a Hamiltonian cycle in G as an output. This is a signifi...
متن کاملA fast parallel algorithm for ̄nding Hamiltonian cycles in dense graphs
Suppose 0 < η < 1 is given. We call a graph, G, on n vertices an η-Chvatal graph if its degree sequence d1 ≤ d2 ≤ . . . ≤ dn satisfies: for k < n/2, dk ≤ min{k + ηn, n/2} implies dn−k−ηn ≥ n− k. (Thus for η = 0 we get the well-known Chvatal graphs.) An NC4-algorithm is presented which accepts as input an η-Chvatal graph and produces a Hamiltonian cycle in G as an output. This is a significant i...
متن کاملCompatible Hamilton cycles in Dirac graphs
A graph is Hamiltonian if it contains a cycle passing through every vertex exactly once. A celebrated theorem of Dirac from 1952 asserts that every graph on n ≥ 3 vertices with minimum degree at least n/2 is Hamiltonian. We refer to such graphs as Dirac graphs. In this paper we obtain the following strengthening of this result. Given a graph G = (V,E), an incompatibility system F over G is a fa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 308 شماره
صفحات -
تاریخ انتشار 2008